翻訳と辞書 |
Even–Paz protocol : ウィキペディア英語版 | Even–Paz protocol The Even-Paz algorithm is an computationally-efficient algorithm for fair cake-cutting. It involves a certain heterogeneous and divisible resource, such as a birthday cake, and ''n'' partners with different preferences over different parts of the cake. It allows the ''n'' people to achieve a proportional division. == History == The first published algorithm for proportional division of a cake was the Last diminisher algorithm, published in 1948. Its run-time complexity was O(''n''^2). in 1984, Shimon Even and Azaria Paz published their improved algorithm, whose run-time complexity is only O(''n'' log ''n'').
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Even–Paz protocol」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|